#include <algorithm>
#include <cstdio>
#include <cstring>
typedef unsigned long long ull;
const int N = 10005;
int n;
ull a[N];
char str[1505];
ull hash(char *str) {
	ull res = 0;
	short l = strlen(str);
	for (int i = 0; i < l; ++i) { res = (res * 233 + (ull)str[i]); } //自然溢出
	return res;
}
int main() {
#ifndef ONLINE_JUDGE
#ifdef LOCAL
	freopen("testdata.in", "r", stdin);
	freopen("testdata.out", "w", stdout);
#endif
#ifndef LOCAL
	freopen("Hash.in", "r", stdin);
	freopen("Hash.out", "w", stdout);
#endif
#endif
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i) {
		scanf("%s", str);
		a[i] = hash(str);
	}
	std::sort(a + 1, a + n + 1);
	int ans = n;
	for (int i = 1; i < n; ++i) {
		if (a[i] == a[i + 1]) { --ans; }
	}
	printf("%d", ans);
	return 0;
}